Theory and Methodology An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
نویسنده
چکیده
In this paper we consider the two-dimensional (2D) rectangular packing problem, where a ®xed set of items have to be allocated on a single object. Two heuristics, which belong to the class of packing procedures that preserve bottomleft (BL) stability, are hybridised with three meta-heuristic algorithms (genetic algorithms (GA), simulated annealing (SA), naõve evolution (NE)) and local search heuristic (hill-climbing). This study compares the hybrid algorithms in terms of solution quality and computation time on a number of packing problems of dierent size. In order to show the eectiveness of the design of the dierent algorithms, their performance is compared to random search (RS) and heuristic packing routines. Ó 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Meta-heuristic Algorithms for an Integrated Production-Distribution Planning Problem in a Multi-Objective Supply Chain
In today's globalization, an effective integration of production and distribution plans into a unified framework is crucial for attaining competitive advantage. This paper addresses an integrated multi-product and multi-time period production/distribution planning problem for a two-echelon supply chain subject to the real-world variables and constraints. It is assumed that all transportations a...
متن کاملA Novel Adapted Multi-objective Meta-heuristic Algorithm for a Flexible Bi-objective Scheduling Problem Based on Physics Theory
We relax some assumptions of the traditional scheduling problem and suggest an adapted meta-heuristic algorithm to optimize efficient utilization of resources and quick response to demands simultaneously. We intend to bridge the existing gap between theory and real industrial scheduling assumptions (e.g., hot metal rolling industry, chemical and pharmaceutical industries). We adapt and evalua...
متن کاملConsolidated Technique of Response Surface Methodology and Data Envelopment Analysis for setting the parameters of meta-heuristic algorithms - Case study: Production Scheduling Problem
In this study, given the sequence dependent setup times, we attempt using the technique of Response Surface Methodology (RSM) to set the parameters of the genetic algorithm (GA), which is used to optimize the scheduling problem of n job on 1 machine (n/1). It aims at finding the most suitable parameters for increasing the efficiency of the proposed algorithm. At first, a central composite d...
متن کاملAn empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
In this paper we consider the two-dimensional rectangular packing problem, where a fixed set of items have to be allocated on a single object. Two heuristics, which belong to the class of packing procedures that preserve bottom-left stability, are hybridised with three meta-heuristic algorithms (genetic algorithms, simulated annealing, naïve evolution) and local search heuristic (hill-climbing)...
متن کاملA multi-objective integrated production-allocation and distribution planning problem of a multi-echelon supply chain network: two parameter-tuned meta-heuristic algorithms
Supply chain management (SCM) is a subject that has found so much attention among different commercial and industrial organizations due to competing environment of products. Therefore, integration of constituent element of this chain is a great deal. This paper proposes a multi objective production-allocation and distribution planning problem (PADPP) in a multi echelon supply chain network. We ...
متن کامل